Performance guarantees for scheduling algorithms under perturbed machine speeds

Performance guarantees for scheduling algorithms under perturbed machine speeds

We study two local search algorithms and a greedy algorithm for scheduling. The worstcase performance guarantees are well-known but seem to be contrived and too pessimistic for practical applications. For unrestrictedmachines, Brunsch et al. (2013) showed that the worst-case performance guarantees of these algorithms are not robust if the job sizes are subject to random noise. However, in the c...

Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies

Empirical Virtual Machine Models for Performance Guarantees

Existing Virtual Machine (VM) management systems rely on host resource utilization metrics to allocate and schedule VMs. Many management systems only consolidate and migrate VMs based on hosts’ CPU utilizations. However, the performance of delay-sensitive workloads, such as web services and online transaction processing, can be severely degraded by contention on numerous of the hosts’ component...

Two machine mixed shop scheduling problem with controllable machine speeds

This paper considers a scheduling problem in which the objective is to determine an optimal machine speed pair and an optimal schedule. There are two machines A, B and n jobs each of which consists of two operations. One operation is to be processed on machine A and the other on machine B. All jobs are open shop type, i.e., processing order of two operations is not specified and so processing o...

Machine scheduling for multitask machining

Multitasking is an important part of today’s manufacturing plants. Multitask machine tools are capable of processing multiple operations at the same time by applying a different set of part and tool holding devices. Mill-turns are multitask machines with the ability to perform a variety of operations with considerable accuracy and agility. One critical factor in simultaneous machining is to cre...